Compositional Automata Learning of Synchronous Systems

نویسندگان

چکیده

Abstract Automata learning is a technique to infer an automaton model of black-box system via queries the system. In recent years it has found widespread use both in industry and academia, as enables formal verification when no available or too complex create one manually. this paper we consider problem individual components synchronous system, assuming can only query whole We introduce compositional approach which several learners cooperate, each aiming learn components. Our experiments show that, many cases, our requires significantly fewer than widely-used non-compositional algorithm such $$\mathtt {L^*}$$ L ∗ .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning-Based Compositional Verification for Synchronous Probabilistic Systems

We present novel techniques for automated compositional verification of synchronous probabilistic systems. First, we give an assume-guarantee framework for verifying probabilistic safety properties of systems modelled as discretetime Markov chains. Assumptions about system components are represented as probabilistic finite automata (PFAs) and the relationship between components and assumptions ...

متن کامل

Open Synchronous Cellular Learning Automata

Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning automata which can interact together. In some applications such as image processing, a type of cellular learning automata in which the ...

متن کامل

Bayesian Learning of Non-compositional Phrases with Synchronous Parsing

We combine the strengths of Bayesian modeling and synchronous grammar in unsupervised learning of basic translation phrase pairs. The structured space of a synchronous grammar is a natural fit for phrase pair probability estimation, though the search space can be prohibitively large. Therefore we explore efficient algorithms for pruning this space that lead to empirically effective results. Inc...

متن کامل

Bayesian Learning of Non-Compositional Phrases with Synchronous Parsing

We combine the strengths of Bayesian modeling and synchronous grammar in unsupervised learning of basic translation phrase pairs. The structured space of a synchronous grammar is a natural fit for phrase pair probability estimation, though the search space can be prohibitively large. Therefore we explore efficient algorithms for pruning this space that lead to empirically effective results. Inc...

متن کامل

Department of Computer Science LEARNING-BASED COMPOSITIONAL VERIFICATION FOR SYNCHRONOUS PROBABILISTIC SYSTEMS

We present novel, fully-automated techniques for compositional verification of synchronous probabilistic systems. First, we give an assume-guarantee framework for verifying probabilistic safety properties of systems modelled as discrete-time Markov chains. Assumptions about system components are represented as probabilistic finite automata (PFAs) and the relationship between components and assu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-30826-0_3